منابع مشابه
Juillet 2002
This paper focuses on the concept of a psychological contract. It argues that research analyzing the employment relationship through this concept tends to overlook the constraints which actually mark the actors' behavoirs. A lot of papers dealing with the Psychological contract approach conveys the view of a free actor. To support this thesis, this paper will first review some of the main featu...
متن کاملNuméro bibliothèque: ThèsedeDoctoratdel’universitéParisVI
The deployment of Self-Organizing Networks (SONs) raises a number of key design issues such as scalability, spontaneity, ease-of-management, adaptability, and dynamicallychanging topologies. In this context, routing is particularly challenging, and requires revisiting important components of the routing architecture/protocol suite, such as, establishing and managing an addressing scheme, provid...
متن کاملBulteau N ̊ 3209 Juillet 1997
An eecient family of methods to evaluate network reliability is the class of factoring algorithms. Their eeciency is due to the use of reliability-preserving reductions (for instance, series-parallel ones). In this work, we follow a similar approach for the problem of counting the (s; t)-mincuts of a graph with size i, for all i. In order to take into account these possible reductions, the pape...
متن کامل’ Aide à la Décision UMR 7243 Juillet 2012 An emergency management model for a wireless sensor network problem
We present a natural wireless sensor network problem, which we model as a probabilistic version of the min dominating set problem. We show that this problem, being a generalization of the classical min dominating set, is NP-hard, even in bipartite graphs. We first study the complexity of probabilistic min dominating set in graphs where min dominating set is polynomial, mainly in trees and paths...
متن کاملLaboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Juillet 2012
We present a natural wireless sensor network problem, which we model as a probabilistic version of the min dominating set problem. We show that this problem, being a generalization of the classical min dominating set, is NP-hard, even in bipartite graphs. We first study the complexity of probabilistic min dominating set in graphs where min dominating set is polynomial, mainly in trees and paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Regards économiques
سال: 2018
ISSN: 2033-3013
DOI: 10.14428/regardseco2012.07.01